A ground-complete axiomatization of stateless bisimilarity over Linda
نویسندگان
چکیده
This paper offers a finite, ground-complete axiomatization of stateless bisimilarity over the tuple-space-based coordination language Linda. As stepping stones towards that result, axiomatizations of stateless bisimilarity over the sequential fragment of Linda without the nask primitive, and over the full sequential sublanguage are given. It is also shown that stateless bisimilarity coincides with standard bisimilarity over the sequential fragment of Linda without the nask primitive.
منابع مشابه
On the Existence of a Finite Base for Complete Trace Equivalence over BPA with Interrupt
We study Basic Process Algebra with interrupt modulo complete trace equivalence. We show that, unlike in the setting of the more demanding bisimilarity, a ground complete finite axiomatization exists. We explicitly give such an axiomatization, and extend it to a finite complete one in the special case when a single action is present.
متن کاملAxiomatization without Prefix Combinator
The chi calculus proposed several years ago enjoys some properties unknown from the experience with pi calculus, one of which is the ability to model concurrent computation without the use of prefix combinator. The atomic chi calculus studied in this paper is obtained from polyadic chi calculus by leaving out the prefix operator. This omission is impossible in the pi framework because it would ...
متن کاملAlgebraic Meta-Theory of Processes with Data
There exists a rich literature of rule formats guaranteeing different algebraic properties for formalisms with a Structural Operational Semantics (SOS). Moreover, there exist a few approaches for automatically deriving axiomatizations characterizing strong bisimilarity of processes. To our knowledge, this literature has never been extended to the setting with data (e.g. to model storage and mem...
متن کاملComplete Axiomatization for the Bisimilarity Distance on Markov Chains
In this paper we propose a complete axiomatization of the bisimilarity distance of Desharnais et al. for the class of finite labelled Markov chains. Our axiomatization is given in the style of a quantitative extension of equational logic recently proposed by Mardare, Panangaden, and Plotkin (LICS’16) that uses equality relations t ≡ε s indexed by rationals, expressing that “t is approximately e...
متن کاملAxiomatization of a Class of Parametrised Bisimilarities 1 Axiomatization of a Class of Parametrised Bisimilarities
The question of when two nondeterministic concurrent systems are behaviourally related has occupied a large part of the literature on process algebra and has yielded a variety of equivalences (and congruences) and preorders ( and precongruences) all based on the notion of bisimulations. Recently one of the authors has tried to unify a class of these bisimulation based relations by a parametrise...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 115 شماره
صفحات -
تاریخ انتشار 2015